Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
91	Efficient viewshed computation on terrain in external memory Marcus V. A. Andrade1,2 , Salles V. G. Magalh˜aes1 , Mirella A. Magalh˜aes1 , W. Randolph Franklin2 , and Barbara M. Cutler3 1 2 Add to Reading List Source URL: www.cs.rpi.edu Language: English - Date: 2009-11-19 21:17:30 Theoretical computer science Computational complexity theory Analysis of algorithms Geometry Visibility Viewshed Time complexity Algorithm Motion planning Viewshed analysis
92	50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl Add to Reading List Source URL: people.inf.ethz.ch Language: English - Date: 2016-07-12 11:32:46 Operations research Linear programming Convex optimization Combinatorial optimization Computational geometry Bounding sphere LP-type problem Simplex algorithm Time complexity Mathematical optimization Integer programming Duality
93	Efficient Secure Computation Optimization Raphael Urmoneit Florian Kerschbaum Technische Universität Add to Reading List Source URL: www.fkerschbaum.org Language: English - Date: 2013-08-28 05:10:42 Complexity classes Theoretical computer science Computational resources Mathematical logic Computability theory Algorithm Recursion NP DSPACE FO Exponential time hypothesis Time complexity
94	Differentially Private Integer Partitions and their Applications Jeremiah Blocki Microsoft Research Abstract Given a positive integer N ≥ 0 a partition of N is a non-increasing sequence of numbers x1 ≥ x2 . . . ≥ x Add to Reading List Source URL: tpdp16.cse.buffalo.edu Language: English - Date: 2016-06-08 10:11:54 Information privacy Exponentials Analysis of algorithms Applied probability Exponential mechanism Differential privacy Time complexity Password Exponential time hypothesis Partition Algorithm Exponential function
95	Tight Bounds for Parallel Randomized Load Balancing Christoph Lenzen, Roger Wattenhofer {lenzen,wattenhofer}@tik.ee.ethz.ch arXiv:1102.5425v1 [cs.CC] 26 Feb 2011 Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:23 Analysis of algorithms Balls into bins With high probability Randomized algorithm Time complexity Chernoff bound Maximal independent set EdmondsPruhs protocol
96	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Counting Triangulations Approximately Victor Alvarez∗ Karl Bringmann† Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:44 Triangulation Analysis of algorithms Computational complexity theory Time complexity Big O notation NC Matching Algorithm Minimum-weight triangulation Planar separator theorem
97	CS369E: Communication Complexity (for Algorithm Designers) Lecture #7: Lower Bounds in Algorithmic Game Theory∗ Tim Roughgarden† March 5, 2015 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-09-14 17:18:05 Game theory Computational complexity theory Quantum complexity theory Complexity classes Decision theory Nash equilibrium Price of anarchy Exponential time hypothesis Circuit complexity Communication complexity Algorithmic game theory PP
98	Economics and Computation ECONand CPSCProfessor Dirk Bergemann and Professor Joan Feigenbaum Lecture IV Add to Reading List Source URL: zoo.cs.yale.edu Language: English - Date: 2008-10-07 04:07:53 Complexity classes Computational complexity theory Boolean algebra Structural complexity theory NP-complete problems Boolean satisfiability problem NP PP Reduction True quantified Boolean formula Exponential time hypothesis P
99	CS261: A Second Course in Algorithms Lecture #15: Introduction to Approximation Algorithms∗ Tim Roughgarden† February 23, 2016 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-02-28 14:26:27 NP-complete problems Knapsack problem Set cover problem Steiner tree problem Vertex cover Approximation algorithm Greedy algorithm Dynamic programming Minimum spanning tree Algorithm Time complexity NP
100	Sorting and Selection on Dynamic Data∗ Aris Anagnostopoulos† Ravi Kumar‡ Mohammad Mahdian‡ Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Analysis of algorithms Sorting algorithms Computational complexity theory Permutations Quicksort Science Selection algorithm FisherYates shuffle Algorithm Time complexity Sort Best worst and average case

UPDATE